Unrolled Compressed Blind-Deconvolution

نویسندگان

چکیده

The problem of sparse multichannel blind deconvolution (S-MBD) arises frequently in many engineering applications such as radar/sonar/ultrasound imaging. To reduce its computational and implementation cost, we propose a compression method that enables recovery from much fewer measurements with respect to the full received signal time. proposed measures through filter followed by subsampling, allowing for significant reduction cost. We derive theoretical guarantees identifiability compressed measurements. Our results allow design wide class filters. We, then, data-driven unrolled learning framework learn solve S-MBD problem. encoder is recurrent inference network maps into an estimate demonstrate our more robust choices source shapes has better performance compared optimization-based methods. Finally, data-limited (fewshot learning), highlight superior generalization capability conventional deep learning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Light Field Blind Deconvolution

We address for the first time the issue of motion blur in light field images captured from plenoptic cameras (instead of camera arrays), where the spatial sampling in each view is decimated. We propose a solution to the estimation of a sharp light field given a blurry one, when the motion blur point spread function is unknown, i.e., the so-called blind deconvolution problem. Unfortunately, the ...

متن کامل

Progressive Blind Deconvolution

We present a novel progressive framework for blind image restoration. Common blind restoration schemes first estimate the blur kernel, then employ non-blind deblurring. However, despite recent progress, the accuracy of PSF estimation is limited. Furthermore, the outcome of non-blind deblurring is highly sensitive to errors in the assumed PSF. Therefore, high quality blind deblurring has remaine...

متن کامل

Learning Blind Deconvolution

In this work, we propose a novel prior term for the regularization of blind deblurring methods. The proposed method introduces machine learning techniques into the blind deconvolution process. The proposed technique has sound mathematical foundations and is generic to many inverse problems. We demonstrate the usage of this regularizer within Bayesian blind deconvolution framework, and also inte...

متن کامل

Undercomplete Blind Subspace Deconvolution

Here, we introduce the blind subspace deconvolution (BSSD) problem, which is the extension of both the blind source deconvolution (BSD) and the independent subspace analysis (ISA) tasks. We treat the undercomplete BSSD (uBSSD) case. Applying temporal concatenation we reduce this problem to ISA. The associated ‘high dimensional’ ISA problem can be handled by a recent technique called joint f-dec...

متن کامل

Complete Blind Subspace Deconvolution

Cocktail-party Problems (increasing generality): • Independent component analysis (ICA) [1, 2]: onedimensional sound sources. • Independent subspace analysis (ISA) [3]: independent groups of people. • Blind source deconvolution (BSD) [4]: one-dimensional sound sources and echoic room. • Blind subspace deconvolution (BSSD) [5]: independent source groups and echoes. Separation Theorem: • ISA ([3]...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2023

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2023.3278861